Modelling Security Protocols based on Smart Cards

Security protocols based on smart cards lack formal analysis. The theoretic analysis by Bellare & Rogaway is the best example in this small eld. We propose an alternative approach obtained as an extension to Paulson's Inductive Approach, which is based on theorem proving. Our model certainly relies on a consistently smaller formal overhead, but carries adequate expressiveness allowing smart cards to be lost or cracked by an eavesdropper. The model is tested on the Shoup-Rubin protocol, and several guarantees proved to show that the model behaves as it is meant to. We believe that our work might make the formal analyses of protocols based on smart cards a more common practice. Our treatment should be understandable also outside the theorem proving community.